Double hashing technique in closed hashing search process
نویسندگان
چکیده
منابع مشابه
Double hashing with passbits
Double hashing with bucket capacity one is augmented with multiple passbits to obtain significant reduction to unsiccessful search lengths. This improves the analysis of Martini et al.[3] by providing a closed form expression for the expected unsuccessful search lengths.
متن کاملSecured Personalized Web Search using Ontology and Hashing Technique
Personalized Web Search is a best way to improve search quality by customizing search results for the users with individual information goals. This is achieved through implicitly collection of user profiles, browsing history, clicked through data, bookmarks, location of the user. However, users are not willing to expose their private preference information to search engines. Many research are u...
متن کاملDouble-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to its fast query speed and low storage cost. Because it is NP hard to directly compute the best binary codes for a given data set, mainstream hashing methods typically adopt a two-stage strategy. In the first stage, severa...
متن کاملSimilarity Search in High Dimensions via Hashing
The nearestor near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. Unfortunately, all known...
متن کاملIncremental Hashing in State Space Search
State memorization is essential for state-space search to avoid redundant expansions and hashing serves as a method to, address store and retrieve states efficiently. In this paper we introduce incremental state hashing to compute hash values in constant time. The method will be most effective in guided depth-first search traversals of state space graphs, like in IDA*, where the computation of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2017
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/237/1/012027